منابع مشابه
Constructive Negation Using
A method for extracting positive information from negative goals is proposed. The method makes use of knowledge about the existence of solutions of predicates and about the types of variables. It strictly generalises earlier work in this area. It can be used as a construction rule or as a simpliication rule. As a construction rule it does not involve an SLD-derivation of the negated sub-goal an...
متن کاملConstructive Negation and Constraints
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, Constraint Lo...
متن کاملConstructive Negation in CLP(H)
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, with the spre...
متن کاملSLDNF, Constructive Negation and Grounding
In some approaches to the declarative semantics of logic programming, a program is treated as shorthand for the propositional program Ground(() whose rules are the ground instances of the rules of. We relate the success and failure of a program with a goal G under SLDNF with constructive negation to the success and failure of Ground(() with ground instances of G under propositional SLDNF. As a ...
متن کاملConstructive negation without subsidiary trees
In this paper we propose a new operational semantics, called BCN, which is sound and complete with respect to Clark-Kunen's completion for the unrestricted class of Normal Logic Programs. BCN is based on constructive negation and can be seen as an operational semantics for the class of Normal Constraint Logic Programs (NCLP) over the Herbrand universe. The main features of BCN making it a usefu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00092-1